On Diagonally Relaxed Orthogonal Projection Methods
نویسندگان
چکیده
منابع مشابه
On Diagonally Relaxed Orthogonal Projection Methods
We propose and study a block-iterative projections method for solving linear equations and/or inequalities. The method allows diagonal component-wise relaxation in conjunction with orthogonal projections onto the individual hyperplanes of the system, and is thus called diagonally-relaxed orthogonal projections (DROP). Diagonal relaxation has proven useful in accelerating the initial convergence...
متن کاملRelaxed Alternating Projection Methods
In this paper we deal with the von Neumann alternating projection method xk+1 = PAPBxk and with its generalization of the form xk+1 = PA(xk + k(PAPBxk xk)), where A;B are closed and convex subsets of a Hilbert space H and FixPAPB 6= ?. We do not suppose that A \ B 6= ?. We give su¢ cient conditions for the weak convergence of the sequence (xk) to FixPAPB in the general case and in the case A is...
متن کاملFiltering En Restarting Orthogonal Projection Methods Filtering En Restarting Orthogonal Projection Methods
We consider the class of the Orthogonal Projection Methods (OPM) to solve iteratively large and generalised eigenvalue problems. An OPM is a method that projects a large eigenvalue problem on a smaller subspace. In this subspace, an approximation of the eigenvalue spectrum can be computed from a small eigenvalue problem using a direct method. We show that many iterative eigenvalue solvers, such...
متن کاملEvaluation of Loop Grouping Methods Based on Orthogonal Projection Spaces
This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space J onto a k-dimensional one, called the projected space, using (n-k) linear independent vectors. The dimension k is selected differently in each method giving various results. The projected space is divided into discrete groups of related iterations, which are assigned t...
متن کاملTwo-step Systems for G-h-relaxed Pseudococoercive Nonlinear Variational Problems Based on Projection Methods
The approximation-solvability of a generalized system of nonlinear variational inequalities (SNVI) involving relaxed pseudococoercive mappings, based on the convergence of a system of projection methods, is presented. The class of relaxed pseudococoercive mappings is more general than classes of strongly monotone and relaxed cocoercive mappings. Let K1 and K2 be nonempty closed convex subsets o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2008
ISSN: 1064-8275,1095-7197
DOI: 10.1137/050639399